WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            main(x1) -> map#2(rmap#2(x1,Nil()))
            map#2(Cons(x32,x6)) -> Cons(x32,map#2(x6))
            map#2(Nil()) -> Nil()
            rmap#2(Cons(x32,x10),x6) -> rmap#2(x10,Cons(x32,x6))
            rmap#2(Nil(),x2) -> x2
        - Signature:
            {main/1,map#2/1,rmap#2/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {main,map#2,rmap#2} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(5) x "A"(5)] -(5)-> "A"(5)
          Cons :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
          Cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          Nil :: [] -(0)-> "A"(5)
          Nil :: [] -(0)-> "A"(7)
          Nil :: [] -(0)-> "A"(8)
          Nil :: [] -(0)-> "A"(14)
          main :: ["A"(8)] -(12)-> "A"(0)
          map#2 :: ["A"(5)] -(7)-> "A"(0)
          rmap#2 :: ["A"(7) x "A"(5)] -(2)-> "A"(5)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Cons_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))